Reaction Temperature Constraints in DNA Computing
نویسنده
چکیده
Using the thermodynamics of DNA melting, a technique is proposed to choose a reaction temperature for the DNA computation that minimizes the potential for mishybridizations. Adleman[Adleman, 1994] showed the computational potential of the hybridization reaction and other molecular biology protocols. A basic framework for a computation based on oligonucleotide template matching reactions, or hybridizations, consists of three steps: 1) encoding of the problem instance in DNA oligonucleotides such that solution is enabled with molecular biology protocols, 2) the basic processing of the pool of oligonucleotides with hybridization and ligation reactions, and 3) extraction of the result with separation techniques, such as polymerase chain reaction (PCR) or hybridization to probe sequences attached to magnetic beads. Ideally, oligonucleotide hybridizations occur only between Watson-Crick complements. Depending upon the conditions under which the hybridization is done, however, base pairs that are not WatsonCrick complements, or mismatched base pair, can occur[Sambrook et al., 1989]. In addition, olgionucleotides can hybridize in various alignments that are shifted from the designed one. These mishybridizations can produce false positives, or solutions to the DNA computation that appear to be correct, but actually are not, and false negatives, or the failure to produce a solution to a problem with DNA computation when one actually exists. The e ect of the reaction conditions is characterized as the hybridization stringency. In general, as the reaction temperature of the hybridization is increased up to a critical point, the stringency increases. The temperature at which half the population of perfectly matched oligonucleotide hybrids will have dissociated into single strands is called the melting temperature, Tm. The melting temperature is determined from curves of UV absorbance versus temperature, and can be interpreted as the fraction of single strands versus temperature[Wetmur, 1997]. Under conditions of low stringency, oligonucleotides can hybridize with more mismatched base pairs and over shorter lengths than under conditions of high stringency. Therefore, under assumptions of perfect Watson-Crick hybridization or perfect Watson-Crick complementation between oligonucleotides, an e ect of the hybridization stringency is to introduce a possibility of false positives and negatives through mismatched hybridizations and shifted hybridizations. These mishybridizations can occur either in the basic processing step (step 2 above) or in the extraction process (step 3 above). In this paper, a method based on the thermodynamics of DNA melting is used to estimate the reaction temperature for a given oligonucleotide encoding of a problem. The nearest-neighbor base stacking model[Borer et al., 1974] for the melting temperature of short oligonucleotides is used. The estimated reaction temperature should minimize the potential for mishybridizations. An upper limit on the reaction temperature is estimated from the melting temperature and half-width of the melting curve of the oligonucleotide with the lowest melting temperature. A lower limit is set by requiring that the oligonucleotide with the highest melting temperature have minimum potential for mishybridizing with its nearest neighbor, as measured by the Hamming distance. Based on a model of nearest neighbor stacking interactions, a formula for non-self complementary oligonucleotide melting temperature is given by[Borer et al., 1974],
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملFault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملDna Sequence Design for Dna Computation Based on Binary Particle Swarm Optimization
Deoxyribonucleic Acid (DNA) has certain unique properties such as selfassembly and self-complementary in hybridization, which are important in many DNAbased technologies. DNA computing, for example, uses these properties to realize a computation in vitro, which consists of several chemical reactions. Other DNA-based technologies such as DNA-based nanotechnology and polymerase chain reaction als...
متن کاملA Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملTemperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges
We propose an encoding method of numerical data in DNA using temperature gradient. We introduce melting temperature (Tm) for this purpose. Melting temperature is a unique characteristic to manipulate the hybridization and denaturation processes that used in the key steps in DNA computing such as the solution generation step and the amplification step. DNA strands of lower melting temperature te...
متن کامل